Ad hoc group bidding

ABSTRACT

A method includes storing locations of mobile devices that are registered for ad hoc grouping, and matching an access request that specifies a location that corresponds to a goal for an ad hoc grouping with candidate mobile devices that match the access request. The method also includes retrieving network addresses of the candidate mobile devices and sending invitations to join the ad hoc grouping. An ad hoc grouping is formed from the candidate mobile devices accepting the invitations.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of pending U.S. patent applicationSer. No. 15/060,102, filed on Mar. 3, 2016, which is Continuation ofU.S. patent application Ser. No. 14/083,482, filed on Nov. 19, 2013 andnow U.S. Pat. No. 9,307,395 issued on Apr. 5, 2016, the disclosures ofwhich are expressly incorporated herein by reference in theirentireties.

BACKGROUND

Mobile communications have revolutionized our encounters. As we travelthroughout the day, our mobile devices encounter other mobile devices incars, in stores, and in our work. These encounters present opportunitiesfor group purchases, group discounts, and other shared interests.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The features, aspects, and advantages of the exemplary embodiments areunderstood when the following Detailed Description is read withreference to the accompanying drawings, wherein:

FIGS. 1-3 are simplified schematics illustrating an environment in whichexemplary embodiments may be implemented;

FIGS. 4-5 are more detailed schematics illustrating the operatingenvironment, according to exemplary embodiments;

FIGS. 6-11 are diagrams illustrating formation of an ad hoc group,according to exemplary embodiments;

FIGS. 10-12 are diagrams illustrating self-organization of the ad hocgroup, according to exemplary embodiments;

FIGS. 13-14 are diagrams illustrating an auction, according to exemplaryembodiments;

FIG. 15 is a diagram illustrating registration for ad hoc groupings,according to exemplary embodiments;

FIG. 16 is a diagram further illustrating competitive bidding, accordingto exemplary embodiments;

FIG. 17 is a diagram further illustrating personal rules, according toexemplary embodiments;

FIG. 18 is a diagram illustrating freeloader considerations, accordingto exemplary embodiments;

FIG. 19 is a flowchart illustrating a method or algorithm for conductingan auction, according to exemplary embodiments;

FIG. 20 is a diagram illustrating a crosswalk, according to exemplaryembodiments; and

FIGS. 21-22 depict still more operating environments for additionalaspects of the exemplary embodiments.

DETAILED DESCRIPTION

The exemplary embodiments will now be described more fully hereinafterwith reference to the accompanying drawings. The exemplary embodimentsmay, however, be embodied in many different forms and should not beconstrued as limited to the embodiments set forth herein. Theseembodiments are provided so that this disclosure will be thorough andcomplete and will fully convey the exemplary embodiments to those ofordinary skill in the art. Moreover, all statements herein recitingembodiments, as well as specific examples thereof, are intended toencompass both structural and functional equivalents thereof.Additionally, it is intended that such equivalents include bothcurrently known equivalents as well as equivalents developed in thefuture (i.e., any elements developed that perform the same function,regardless of structure).

Thus, for example, it will be appreciated by those of ordinary skill inthe art that the diagrams, schematics, illustrations, and the likerepresent conceptual views or processes illustrating the exemplaryembodiments. The functions of the various elements shown in the figuresmay be provided through the use of dedicated hardware as well ashardware capable of executing associated software. Those of ordinaryskill in the art further understand that the exemplary hardware,software, processes, methods, and/or operating systems described hereinare for illustrative purposes and, thus, are not intended to be limitedto any particular named manufacturer.

As used herein, the singular forms “a,” “an,” and “the” are intended toinclude the plural forms as well, unless expressly stated otherwise. Itwill be further understood that the terms “includes,” “comprises,”“including,” and/or “comprising,” when used in this specification,specify the presence of stated features, integers, steps, operations,elements, and/or components, but do not preclude the presence oraddition of one or more other features, integers, steps, operations,elements, components, and/or groups thereof. It will be understood thatwhen an element is referred to as being “connected” or “coupled” toanother element, it can be directly connected or coupled to the otherelement or intervening elements may be present. Furthermore, “connected”or “coupled” as used herein may include wirelessly connected or coupled.As used herein, the term “and/or” includes any and all combinations ofone or more of the associated listed items.

It will also be understood that, although the terms first, second, etc.may be used herein to describe various elements, these elements shouldnot be limited by these terms. These terms are only used to distinguishone element from another. For example, a first device could be termed asecond device, and, similarly, a second device could be termed a firstdevice without departing from the teachings of the disclosure.

FIGS. 1-3 are simplified schematics illustrating an environment in whichexemplary embodiments may be implemented. A group 20 of mobile devices22 communicates with a resource server 24 using a communications network26. Each mobile device 22, for simplicity, is illustrated as a smartphone 28. Each mobile device 22, though, may be any mobile or stationaryprocessor-controlled device (as later paragraphs will explain).Regardless, exemplary embodiments allow the group 20 of the mobiledevices 22 to band together ad hoc and request some resource 30 from theresource server 24. That is, the mobile devices 22 may spontaneouslyencounter each other and cooperate in real time to improve theircollective chances of receiving the resource 30 from the resource server24. The group 20 of the mobile devices 22, for example, may submit agroup bid 32 for the resource 30. The resource server 24 may auction 34the resource 30 to the highest bid. The group 20 of the mobile devices22 may thus spontaneously form in an ad hoc fashion to increase theircollective chance of winning the auction 34. If the ad hoc group 20 ofthe mobile devices 22 wins the auction 34, then the same ad hoc group 20collectively receives the resource 30 from the resource server 24.

FIG. 2 illustrates traffic resources. Here, the ad hoc group 20 of themobile devices 22 is explained using a common traffic situation. Supposethe resource server 24 controls a traffic light 40 at an intersection ofmultiple roads. The resource server 24 may conduct the auction 34 andaccept bids to change, or to maintain, the traffic light 40 in a “red”or “green” state. The auctioned resource 30, then, may be a duration 42of time associated with a state of the traffic light 40. As severalvehicles 44 approach the intersection, the drivers may all desire tokeep the traffic light 40 “green” for a longer duration 42 of time, thusallowing their respective vehicles 44 to speed through the intersectionwithout stopping. Exemplary embodiments thus allow the drivers' mobiledevices 22 to form the ad hoc group 20 and to negotiate with theresource server 24 to keep the traffic light 40 green. That is, thedrivers' mobile devices 22 discover that they all have a shared, mutualgoal 50 in keeping the traffic light 40 in its green state. The mobiledevices 22 thus spontaneously form the ad hoc group 20 and mutuallyagree to submit the group bid 32 (e.g., to keep the traffic light 40green for the longer duration 42 of time). When the resource server 24receives the group bid 32, the resource server 24 evaluates the groupbid 32 against other, competing bids 52. Indeed, at a busy intersection,there likely will be a competing bid from other vehicles to shorten theduration 42 of time to change the traffic light 40 to “red.” If the adhoc group 20 of the mobile devices 22 wins the auction 34, then theresource server 24 times the traffic light 40 to ensure all the vehicles44 in the ad hoc group 20 speed through the intersection.

FIG. 3 illustrates parking resources. Here, the ad hoc group 20 of themobile devices 22 bids for parking spaces 60 at some event (such as afootball game or concert). Suppose the resource server 24 assigns theparking spaces 60 in a parking garage. As the reader may understand,there may be hundreds, even thousands, of the vehicles 44 vying for alimited number of the parking spaces 60. As many vehicles 44 approachthe parking facility, the drivers may band together and submit the groupbid 32 for all or some of the parking spaces 60. The drivers' mobiledevices 22 discover that they all have the shared, mutual goal 50 inobtaining one of the few available parking spaces 60. The mobile devices22 thus spontaneously form the ad hoc group 20 and mutually agree tosubmit the group bid 32 for several ones of the parking spaces 60. Theresource server 24 evaluates the group bid 32 against the other,competing bids 52 for the same parking spaces 60. If the ad hoc group 20of the mobile devices 22 wins the auction 34, then the resource server24 assigns the parking spaces 60 to all the vehicles 44 in the ad hocgroup 20. The drivers have thus obtained the resource 30 (e.g., theparking spaces 60) in an ad hoc cooperative fashion, and likely closerto the venue than they could individually obtain.

Here, then, exemplary embodiments establish ad hoc communications amongad hoc groupings. Exemplary embodiments allow individual users (i.e.,their mobile devices 22) to discover each other and their shared, mutualintent or goal 50. While the above paragraphs explained the trafficlight 40 and the parking spaces 60, the reader should realize thatexemplary embodiments may be applied to any objective or purpose that isshared by the ad hoc group 20. Whatever the ad hoc group 20 desires toachieve, exemplary embodiments allow the mobile devices 22 to discovereach other and to band together to improve the group result.

FIGS. 4-5 are more detailed schematics illustrating the operatingenvironment, according to exemplary embodiments. FIG. 4 illustrates oneof the mobile devices 22 communicating with the resource server 24 usingthe communications network 26. The mobile device 22 may have a processor70 (e.g., “μLP”), application specific integrated circuit (ASIC), orother component that executes a device-side algorithm 72 stored in alocal memory 74. The resource server 24 may also have a processor 76(e.g., “μLP”), application specific integrated circuit (ASIC), or othercomponent that executes an auction algorithm 78 stored in a local memory80. The device-side algorithm 72 and the auction algorithm 78 may thusinclude instructions, code, and/or programs that cooperate in aserver-client relationship, via the communications network 26, toconduct the auction 34 for the resource 30.

FIG. 5 illustrates the ad hoc group 20 of the mobile devices 22. Whileonly three (3) mobile devices 22 are shown, the ad hoc group 20 may havea membership of many, even hundreds or thousands, of the mobile devices22. Each of the mobile devices 22 in the ad hoc group 20 may store andexecute the device-side algorithm 72. The members of the ad hoc group 20determine their shared, mutual goal 50, as later paragraphs willexplain. The ad hoc group 20 submits, or authorizes, the group bid 32for the resource 30. The auction algorithm 78 causes the resource server24 to evaluate the group bid 32 against the one or more competing bids52 and auction rules 90. If the group bid 32 wins the auction 34, thenthe auction algorithm 78 causes the resource server 24 to award theresource 30 to the ad hoc group 20. That is, each mobile device 22, thatis a member of the ad hoc group 20, receives the resource 30.

Exemplary embodiments may utilize any processing component,configuration, or system. Any of the processors could be multipleprocessors, which could include distributed processors or parallelprocessors in a single machine or multiple machines. Any of theprocessors can be used in supporting a virtual processing environment.Any of the processors could include a state machine, applicationspecific integrated circuit (ASIC), programmable gate array (PGA)including a Field PGA, or state machine. When any of the processorsexecute instructions to perform “operations”, this could include theprocessor performing the operations directly and/or facilitating,directing, or cooperating with another device or component to performthe operations.

Exemplary embodiments may be applied regardless of networkingenvironment. As the above paragraphs mentioned, the communicationsnetwork 26 may be a wireless network having cellular, WI-FI®, and/orBLUETOOTH® capability. The communications network 26, however, may beany wireless long- or short-range network, such as near-fieldcommunications and other radio frequency networks. The communicationsnetwork 26 may be a cable network operating in the radio-frequencydomain and/or the Internet Protocol (IP) domain. The communicationsnetwork 26, however, may also include a distributed computing network,such as the Internet (sometimes alternatively known as the “World WideWeb”), an intranet, a local-area network (LAN), and/or a wide-areanetwork (WAN). The communications network 26 may include any physicallink or wiring, such as coaxial cables, copper wires, fiber optic lines,and/or hybrid-coaxial lines. The communications network 26 may eveninclude wireless portions utilizing any portion of the electromagneticspectrum and any signaling standard (such as the IEEE 802 family ofstandards, GSM/CDMA/TDMA or any cellular standard, and/or the ISM band).The communications network 26 may even include power line portions, inwhich signals are communicated via electrical wiring. The conceptsdescribed herein may be applied to any wireless/wireline communicationsnetwork, regardless of physical componentry, physical configuration, orcommunications standard(s).

FIGS. 6-11 are diagrams illustrating formation of the ad hoc group 20,according to exemplary embodiments. FIG. 6 illustrates a solicitation toform the ad hoc group (illustrated as reference numeral 20 in FIGS. 1-3& 5). As the user goes about her day, she may wish to band together withother like-minded users to achieve the shared, mutual goal 50. Whateverpurpose she wishes to achieve, her mobile device 22 sends an actionrequest 100. FIG. 6 illustrates the action request 100 communicating toa network address of an ad hoc grouping server 102. The ad hoc groupingserver 102 is a network-centric, cloud-based resource that forms andmanages ad hoc groupings. The action request 100, however, may be sentdirectly to other candidate mobile devices 22, as later paragraphs willexplain. In FIG. 6, though, exemplary embodiments may utilize the ad hocgrouping server 102 to form the ad hoc group 20. The action request 100may be formatted using a dictionary 104 of standard, commonly definedterms that all recipients recognize and understand. The action request100, for example, may be formatted as

-   -   ACTION_REQUEST[action code],        where the term “action code” is chosen from the dictionary 104        of standard, common terms. The action code may thus be a        standardized, alphanumeric combination that is assigned to the        goal 50. Using the above examples, the action code may be a        protocol that is defined for increasing the duration of time for        the “green” traffic light (illustrated, respectively, as        reference numerals 44 and 40 in FIG. 2) or for obtaining the        parking spaces (illustrated as reference numeral 60 in FIG. 3).        These are simple examples, of course. In practice the dictionary        104 may contain many, even hundreds, of different definitions        for action codes, reflecting many different common goals 50 of        many different outcomes.

The action request 100 may be more specific. When the user determinesher goal 50, the goal 50 may likely have an associated time, location,and/or other parameters. Again using the traffic light 40 as an example,the user may be required to specify the duration 42 of time formaintaining its state (e.g., red or green). Moreover, the action request100 may uniquely identify the traffic light 40, such as with itsgeographical location (perhaps using global positioning systemcoordinates or other alphanumeric identifier). The action request 100,then, may further include accompanying parameters, such as

-   -   ACTION_REQUEST[action code, timing, location, amount,        parameter(s)].        The action request 100 may thus specify any number of parameters        to accompany the action code. The action request 100, of course,        likely specifies some financial amount, which may be in        conventional currency or tokens. Whatever the parameters, their        values and/or codes are preferably formatted and commonly        understood, according to the dictionary 104, to achieve the        shared, mutual goal 50.

FIG. 7 illustrates candidate recipients of the action request 100. Whenthe mobile device 22 sends the action request 100, the action request100 is likely only useful for like-minded users. That is, only thoseusers potentially having the same goal 50 will want to receive theaction request 100. If the action request 100 has no relevance to auser, the action request 100 may be unwelcome spam.

FIG. 7, then, illustrates location-based groupings. The action request100 may route to the network address (e.g., Internet Protocol address)of the ad hoc grouping server 102. The ad hoc grouping server 102 may bea centralized destination for all action requests 100. The ad hocgrouping server 102 has a processor 110 (e.g., “μP”), applicationspecific integrated circuit (ASIC), or other component that executes agrouping algorithm 112 stored in a local memory 114. The device-sidealgorithm 72 and the ad hoc grouping algorithm 112 may thus includeinstructions, code, and/or programs that cooperate in a server-clientrelationship to form the ad hoc group 20. When the ad hoc groupingserver 102 receives the action request 100, the ad hoc groupingalgorithm 112 causes the processor 110 to consult a database 116 ofgroupings. The database 116 of groupings maintains a centralized listingof the action requests 100 requested by different mobile devices 22 thatwish to form ad hoc groupings to achieve any mutually shared goal 50.FIG. 7 illustrates the database 116 of groupings locally stored in thememory 114 of the ad hoc grouping server 102, but the database 116 ofgroupings may be remotely maintained and accessed. Regardless, thedatabase 116 of groupings is illustrated as a table 118 that maps,relates, or associates the mobile device 22 to its current location 120,time 122, and the action code 124 specified in the access request 100.Each entry in the database 116 of groupings may thus be populated withdifferent action requests 100 that are requested by different mobiledevices 22. When the ad hoc grouping server 102 receives the actionrequest 100, the ad hoc grouping algorithm 112 may query the database116 of groupings for the same action code 124 having the same (or nearlythe same) location 120 and a contemporaneous time 122. If the actioncode 124, location 120, and/or time 122 match any entries in thedatabase 116 of groupings, the ad hoc grouping algorithm 112 retrievesthe corresponding network addresses 128 of the candidate mobile devices22 potentially having the same shared, mutual goal 50. FIG. 7illustrates the ad hoc group 20 as those mobile devices 20 havingmatching locations 120, times 122, and action codes 124.

Groupings, of course, may be based on any affinity. The aboveexplanation uses the matching locations 120 to find the candidate mobiledevices 22. Ad hoc groupings, though, may be determined using any queryparameter that is shared among the mobile devices 22. Ad hoc groupings,for example, may be formed for group purchases of movie tickets,gasoline, replacement windows, tires, and milk. Indeed, the database 116of groupings may be populated with any information desired for groupingcandidate mobile devices 22. Exemplary embodiments may form ad hocgroupings for any expression or indication of a shared affinity.Affinity may even be expressed in varying terms, from any minimum valueto any maximum value.

FIG. 8 illustrates invitations 130 to the candidate mobile devices 22.Once the potential ad hoc group 20 is determined, the ad hoc groupingserver 102 invites the candidate mobile devices 22 to join the ad hocgroup 20. As FIG. 8 illustrates, the ad hoc grouping algorithm 112causes the ad hoc grouping server 102 to send the invitation 130 to eachone of the network addresses 128 of each candidate mobile device 22.When the candidate mobile device 22 receive their respective invitation130, the user may decide if she wants to join the ad hoc group 20 toachieve the same shared, mutual goal 50 (as represented by the commonaction code 124).

FIG. 9 illustrates negotiations of group intention. Once the candidatemobile devices 22 are invited to join the ad hoc group 20, therecipients may accept, decline, or counteroffer. That is, any user maycause her mobile device 22 to send an acceptance 140 to join the ad hocgroup 20 for the same shared, mutual goal 50. If a user has no interestin joining, a decline 142 may be sent to the ad hoc grouping server 102.One or more mobile devices 22, however, may want to alter the parametersand continue negotiation. A counteroffer 144 may then be sent back tothe ad hoc grouping server 102 with standardized options for changing ortweaking the shared, mutual goal 50. The counteroffer 144, for example,may be formatted as

-   -   COUNTEROFFER[options],        where the user specifies her desired changes to the shared,        mutual goal 50 using standard terminology from the dictionary        (illustrated as reference numeral 104 in FIG. 6). Negotiations        may similarly continue until no more counteroffers 144 are made.        That is, negotiations may continue until all potential members        either accept or decline. Negotiations may also terminate after        a configurable time or number of counteroffers 144.

Exemplary embodiments thus automate the formation of the ad hoc group20. As the shared, mutual goal 50 may be time and location dependent (asexplained with reference to FIGS. 7-8), automation is desired to reapthe benefit in a reasonable amount of time. The formation of the ad hocgroup 20, in other words, is meaningless should the mutual time ormutual location (illustrated as reference numerals 122 and 124 in FIGS.7-8) pass without action. Exemplary embodiments may thus impose rulesand/or limits on negotiations to ensure the potential members may stillreceive the shared, mutual goal 50 within any imposed time limit.Exemplary embodiments may thus use simplified, finite protocols withjust one round of negotiation and concluding the group formation withonly the final parties that agree.

FIGS. 10-12 are diagrams illustrating self-organization of the ad hocgroup 20, according to exemplary embodiments. Here the mobile devices 22themselves may orchestrate and manage their ad hoc grouping. The ad hocgroup 20, in other words, may be self-moderated with little or nocentralized oversight. FIG. 10, for example, illustrates one of themobile devices 22 a broadcasting the action request 100. The mobiledevice 22 a may open a WI-FI® or BLUETOOTH® hotspot, for example, butthe action request 100 may be broadcast using any frequency or standard.Regardless, the action request 100 may be received by any candidatemobile devices 22. The action request 100, as earlier explained, may beformatted using the dictionary 104 of standard, commonly defined termsthat all recipients recognize and understand (as FIG. 6 illustrated).The action request 100 may use the standardized action code 124 assignedto the goal 50 (as FIGS. 6-7 illustrated). As the action request 100 isbroadcast to any mobile devices 22, the action request 100 is receivedby any of the candidate mobile devices 22 in the vicinity. Some userswill be receptive to receiving the action request 100, and so receptiverecipient devices will be configured to receive solicitations to form adhoc groupings. Other users, though, will have no interest, so theirmobile devices 22 may be configured to reject receipt of the actionrequest 100.

Here, then, the action request 100 may be an implicit invitation. As theaction request 100 may be broadcast to any mobile devices 22, the actionrequest 100 implicitly invites other mobile devices 22 to form the adhoc group 20 to achieve the same shared, mutual goal 50 (as representedby the action code 124).

As FIG. 11 illustrates, the receptive mobile devices 22 will receive andprocess the action request 100. Should any mobile device 22 receive theaction request 100, its device-side algorithm 72 may compare theparameters in the action request 100 to the user's group rules 146. Theuser's group rules 146 help determine if participation is desired. Theuser's group rules 146, for example, may be a list of different actioncodes 124 for which the user has an interest or affinity. If the actioncode 124 specified in the action request 100 does not match an entry inthe user's group rules 146, then the action request 100 may be ignoredor declined. If the action code 124 matches the user's group rules 146,then the action request 100 may be further evaluated. The action request100, for example, may have more parameters specifying the location 120and the time 122 of the requested ad hoc grouping. The action request100 may also specify financial or other contributions that are requestedof every potential ad hoc group member. The action request 100, ofcourse, may have many parameters defining the shared, mutual goal 50 forwhich grouping is desired. The device-side algorithm 72 may visually oraudibly generate a prompt to confirm participation in the requested adhoc grouping.

As FIG. 12 illustrates, a response may be sent. If user's group rules146 permit participation, the device-side algorithm 72 may generate andsend the acceptance 140 back to the requesting mobile device 22 a. Theacceptance 140, for example, may be broadcast for receipt by therequesting mobile device 22 a. If the network address of the requestingmobile device 22 a is known (perhaps from the action request 100), thenthe acceptance 140 may be sent to the corresponding network address. Anyuser, of course, may manually cause the device-side algorithm 72 to sendthe acceptance 140 (such as after viewing the prompt for the actionrequest 100 in FIGS. 10-11). Exemplary embodiments, however, may alsopermit continued negotiations, such as by broadcasting the counteroffer144 that changes or tweaks the shared, mutual goal 50. As the mobiledevice 22 a requested the ad hoc grouping, it is likely that the user ofthe mobile device 22 a will take a lead role determining how muchnegotiation takes place. The user of the requesting mobile device 22 a,in other words, may arbitrate the formation of the ad hoc group 20.Formational control, however, may transfer to a different user of adifferent mobile device 22 (such as by a new action request 100).

Exemplary embodiments may thus locally form and manage the formation ofthe ad hoc group 20. Mobile devices 22 may broadcast and receivedifferent action requests 100 specifying different shared, mutual goals50. Mobile devices 22 may thus self-form and manage the ad hoc group 20without central oversight. Formation and management may be functionallyperformed by any group member or amongst a mesh net of participatingnodes that self-organize the ad hoc group 20.

FIGS. 13-14 are diagrams illustrating the auction 34, according toexemplary embodiments. Once the ad hoc group 20 is formed, the ad hocgroup 20 submits the group bid 32 for the resource 30. FIG. 13illustrates the group bid 32 originating from one of the mobile devices22 in the ad hoc group 20. One of the mobile devices 22 may beconsidered the leader of the ad hoc group 20 and submits the group bid32 as a proxy for the other members. FIG. 14, however, illustrates thegroup bid 32 originating from ad hoc grouping server 102. As the ad hocgrouping server 102 may manage and track the formation of the ad hocgroup 20, the ad hoc grouping server 102 may also be tasked withsubmitting the group bid 32. Regardless, when the resource server 24receives the group bid 32, the resource server 24 conducts the auction34 and evaluates the group bid 32 against the competing bids 52 and theauction rules 90. Any criteria may be used to determine the winning bid.Once the auction 34 is final, the resource server 24 may notify themember mobile devices 22 of their winning or losing group bid 32. Theresource server 24, in other words, may individually send an auctionoutcome to each mobile device 22 in the ad hoc group 20, or the resourceserver 24 may notify the ad hoc grouping server 102 for furtherdistribution to the member mobile devices 22. If the ad hoc group 20wins the auction 34, the members of the ad hoc group 20 receive theresource 30.

The reader may notice anonymity in the solution. As the ad hoc groupingserver 102 may form and manage the ad hoc group 20, the actual membersneed not know each other's identities. Users may thus band together forthe shared, mutual goal 50 without revealing their individualidentities. The ad hoc grouping server 102 may be the source anddestination for all group communications, thus keeping each member'sidentity private from all other members. Indeed, the ad hoc groupingserver 102 may even submit the group bid 32 without revealing themembership addresses or identities of the ad hoc group 20. As long asthe members share the same mutual goal 50, people may economically bandtogether without regard for personalities, social considerations, andbiases. Legality of the mutual goal 50, however, may be handled by theauction rules 90.

FIG. 15 is a diagram illustrating registration for ad hoc groupings,according to exemplary embodiments. Here users may centrally registertheir interest for any ad hoc groupings that wish to form. Some usersmay wish to publicize their availability for ad hoc groupings on spur ofthe moment goals 50. That is, some users may wish to be notified of anyinvitations 130 to join ad hoc groupings. The user may then decidewhether she wishes to participate. As FIG. 15 illustrates, a user maythus permit the ad hoc grouping server 102 to track and log the currentlocation 120 of her mobile device 22. Her mobile device 22, for example,may periodically send its global positioning system coordinates to thead hoc grouping server 102 for entry in the database 116 of groupings.Should anyone submit the access request 100 for the same, or nearly thesame, location 120, exemplary embodiments may invite the user's mobiledevice 22 to join the ad hoc group 20. The ad hoc grouping server 102,in other words, may invite candidate mobile devices 22 based on theirmatching location 120. The ad hoc grouping server 102 queries thedatabase 116 of groupings for the location 120 specified in the actionrequest 100. The ad hoc grouping algorithm 112 retrieves the networkaddresses 128 of any mobile devices 22 having the matching location 120.The ad hoc grouping algorithm 112 then causes the ad hoc grouping server102 to send or forward the invitation 130 to the network address 128 ofeach candidate mobile device 22 having the matching location 120.

Users may thus register for any ad hoc groupings. By opening up theircurrent location 120, users may receive any invitations 130 for anyshared, mutual goal 50 (as defined by the action code 124). When theuser's mobile device 22 receives the invitation 130, the user may thenevaluate whether she wishes to join the ad hoc group 20 for the sameshared, mutual goal 50. She may send the acceptance 140 and reap thebenefit of shared, mutual goal 50. The user may, however, decide thatshe has no interest in joining the ad hoc group 20. Whatever herdecision, exemplary embodiments thus allow users to be informed of anyspontaneous ad hoc groupings.

Central registration may not be needed for self-management. Mobiledevices 22 may self-form and manage their ad hoc grouping, as explainedwith reference to FIGS. 10-12. In these instances the mobile devices 22may simply broadcast the action request 100 to willing recipients. If amobile device 22 is configured to receive solicitations to form ad hocgroupings, then the action request 100 is processed. If participation inthe ad hoc grouping is desired, the user's mobile device 22 may send theacceptance 140. The user's group rules 146, in other words, may governreceipt of any action request 100, without centralized moderation.

FIG. 16 is a diagram further illustrating competitive bidding, accordingto exemplary embodiments. This disclosure has explained how individualusers, using their mobile devices 22, may spontaneously form the ad hocgroup 20 to achieve the shared, mutual goal 50. The leader or initiatorof the ad hoc group 20 sends or broadcasts the action request 100 as

-   -   ACTION_REQUEST[GroupFormation, parameter(s)],        where the access code “GroupFormation” seeks to form the ad hoc        group 20. As a simple example, one of the parameters may be        “AccelerateProximateStoplight.” When the action request 100 is        received, individual users (or their proxy mobile device 22)        determines if participation is desired (as this disclosure above        explains).

Sometimes, though, participation requires too much. Some ad hoc groups20 may require a large financial contribution or commitment that exceedsthe user's budget. Indeed, some auctions 34 may have a minimum bid 150that exceeds the user's budget. Some ad hoc groupings may requirehundreds, or thousands, of dollars from each participating member. Somead hoc groupings, in simple terms, may be too expensive to join. Otherad hoc groupings may require too much time, or too much participation,from the individual user.

Here, then, each user may further define her group rules 146. Any usermay define her group rules 146 to filter out or ignore any values orparameters that exceed the user's comfort level. As the user'sdevice-side algorithm 72 evaluates whether participation is desired, theuser's group rules 146 may define any parameters for participationand/or for rejection. The device-side algorithm 72, for example, maycompare the group rules 146 to the parameters in the auction rules 90,in the action request 100, and/or in the invitation 130. The group rules146 may thus help the user may decide whether she wishes to participatein the group bid 32. Some ad hoc groupings, for example, may require anindividual minimum contribution 162 (whether of money, tokens, time, orany other measure). Some ad hoc groups 20, for example, may not acceptmembers who are unwilling to pay a minimum amount of money or tokens. Ifthe user wishes to participate, her mobile device 22 sends theacceptance 140, perhaps specifying her level 164 of contribution. Theacceptance 140 may even specify a maximum level 166 of contribution,above which she will no longer participate. If bidding gets heated, theuser may drop out of the ad hoc grouping when her maximum level 166 ofcontribution is exceeded. The leader or initiator of the ad hoc group20, or the ad hoc grouping server 102, may evaluate all the acceptances140 from the participating mobile devices 22. If the ad hoc group 20 canassemble the sufficient group bid 32 to satisfy the auction rules 90,exemplary embodiments may request verifiable payment (e.g., credit cardnumbers or e-tokens) from each mobile device 22. The group bid 32 isthen submitted to the resource server 24 for evaluation.

Contributions may be equal among all members. Sometimes the shared,mutual goal 50 may be structured such that each participating mobiledevice 22 makes an equal contribution to the group bid 32. The trafficlight (illustrated as reference numeral 40 in FIG. 2) is another simpleexample. If the ad hoc group 20 submits the winning group bid 32, thenthe traffic light 40 is timed to allow all the member mobile devices 22(e.g., the users' vehicles 44) to pass through the green light. Thefinancial or token contribution from each vehicle 44 may simply be theamount of the group bid 32 divided by the number of participatingvehicles 44. A ten dollar ($10) group bid 32, for example, may be evenlysplit between ten (10) mobile devices 22, or one dollar ($1) per membermobile device 22. For many auctions 34, this equal billing scenario maybe simplest and adequate.

Other times, though, individual contributions may differ. Even thoughmultiple mobile devices 22 may group together and submit the group bid32, some members may contribute more than other members. Some groupmembers may place a higher value on the shared, mutual goal 50 thanother members. Even though all the members of the ad hoc group 20 mayshare the same mutual goal 50, some members may make a largercontribution to the group bid 32. The leader, or any member, of the adhoc group 20 may thus creatively assemble different member contributionsof the group bid 32. This unequal billing scenario, of course, maycomplicate negotiations. Again using the example of the traffic light40, all members of the ad hoc group 20 speed through the green light,even though some members may have contributed more money to the groupbid 32. One solution if for the ad hoc grouping server 102 to assign apriority or processional order to the ad hoc group 20 to ensure highercontributing members first receive the resource 30. Lesser rankingcontributions of the winning ad hoc group 20 may be moved to rearwardpositions in the processional order, where there is a greater chance oflosing to a subsequent auction 34.

Ad hoc groupings may also be abandoned. There will be times when the adhoc group 20 fails to form. For example, someone may submit the actionrequest 100, but no one accepts. In this case, the user may choose to goit alone and participate in the auction 34 as an individual bidder. Thatis, the user bids to solely pay for the resource 30 (such as theexpedited traffic light 40). Even if other mobile devices 22 doparticipate in the group bid 32, perhaps the group bid 32 isinsufficient to satisfy the required minimum bid 150. The ad hoc group20 may thus fail. Finally, abandonment may occur when negotiations arecomplex, thus requiring too much time to finalize the group bid 32.Whatever the reasons, ad hoc groupings may fail to form.

FIG. 17 is a diagram further illustrating the user's personal grouprules 146, according to exemplary embodiments. As the above paragraphsexplained, the user's personal group rules 146 may govern individualparticipation in the ad hoc group 20. The user's personal group rules146, for example, may store her maximum level 166 of contribution forany group bid 32. The user, for example, may establish a rule that shewill pay no more than one dollar ($1) as a micro-contribution 164 to anygroup bid 32. The user's personal group rules 146 may also define a list170 of resources for which she will consider bidding. If the actionrequest (illustrated as reference numeral 100 in FIG. 16) does notspecify one of the resources 30 in the list 170 of the resources, thenthe device-side algorithm 72 may have authority to decline theinvitation 130. The user's personal group rules 146 may, likewise,define a list 172 of goals for which she will consider bidding. If theinvitation 130 does not specify one of the action codes 124 in the list172 of goals, then the user is likely not interested in participating.The user's personal group rules 146 may further define the dates andtimes of auctions 34 for which she will, and will not, participate. Theuser may not want to be notified of auctions 34 occurring duringsleeping hours, vacations, or other personally important occasions.

The user's group rules 146 may also specify other considerations. Someauctions 34 and/or invitations 130 may have an urgency 174, for whichthe user may or may not accept. Some users, in other words, may declinesituations in which quick, perhaps ill-informed judgments are required.The user's group rules 146 may also specify a minimum number 176 ofparticipants, thus ensuring her maximum level 166 of contribution forany single group bid 32 is satisfied. The user's group rules 146 mayalso track and tally or sum her contributions, ensuring a maximummonthly contribution 178 is never exceeded. The user's group rules 146may even establish an absolute maximum expenditure 180, perhaps on ayearly basis. Exemplary embodiments thus allow the user to monitor andtrack her participation to ensure her budget is not exceeded. The user'spersonal group rules 146, in simple terms, may be as detailed as shewishes to ensure she only participates in personally relevant auctions34.

FIG. 18 is a diagram illustrating freeloader considerations, accordingto exemplary embodiments. Even though the ad hoc group 20 may win theauction 34 and receive the resource 30, there may be non-participantswho also receive the same resource 30. Again, considering the trafficlight 40, the ad hoc group 20 of vehicles may band together and win theauction 34 to increase the duration 44 of the green light. As the ad hocgroup 20 of vehicles drives through the extended green light, othervehicles may also speed along through the same green light. That is, afreeloader vehicle 180 receives the same resource 30 (e.g., the greenlight) without contributing to the group bid 32. Indeed, fairness isespecially questioned if the freeloader vehicle 180 declined to join thead hoc group 20 of vehicles.

Network addressing may identify freeloaders. Each mobile device 22usually has a unique network address (such as an Internet Protocoladdress). As the ad hoc group 20 speeds through the green light, thelocation and address of each passing or moving mobile device 22 may bemonitored. The freeloader vehicle 180, with its freeloader mobile device20, may thus be identified as passing through the same green light.Indeed, whatever the resource 30, the unique network addresses assignedto different mobile devices 22 may be used to track and identifyfreeloaders. Any other mechanism, of course, may be used to spotfreeloaders, especially those freeloaders that decline to join the adhoc group 20.

Exemplary embodiments, then, may automatically assess freeloaders. If afreeloader situation is discovered, exemplary embodiments may assess afreeloader contribution 182 from the freeloading vehicle 180 for theshared, mutual goal 50. The freeloader vehicle 180, in other words,would not have made the extended green light but for the group bid 32 bythe member vehicles 44. Exemplary embodiments may thus monitor and trackthe location 120 of any mobile device 22 that receives the same shared,mutual goal 50 (as earlier explained). If a freeloader mobile device 184receives the same shared, mutual goal 50 without joining the ad hocgroup 20, the freeloader mobile device 184 may be assessed theinvoluntary freeloader contribution 182 to the group bid 32. Should thead hoc grouping server 102 determine that the freeloader mobile device184 has a sequential path of locations 120 and times that match a memberof the ad hoc group 20, the freeloader mobile device 184 may be assessedthe involuntary contribution freeloader contribution 182. Exemplaryembodiments may further have the group requester submit a good-faithinitial contribution and show an e-receipt to the other vehicles whenrequesting their contributions. Exemplary embodiments, in other words,may include an escrow system in which each participant keeps reserves.Should the group bid 32 escalate, contribution from each participant'sescrow is still assured, thus allowing the group leader to continuebidding without further coordination or negotiation.

The vehicles 44 may be considered the mobile devices 22. As the readermay realize, many modern vehicles have transceivers for cellular,WI-FI®, BLUETOOTH®, satellite, and other communications capabilities.Whatever the communications capability, exemplary embodiments mayregister and treat any vehicle 44 as one of the mobile devices 22. Thead hoc grouping server 102, for example, may track the current location120 of any vehicle 44 and invite the vehicle 44 to join any of the adhoc groupings. As this disclosure explains, the mobile devices 22 andeven the vehicles 44 may band together in an ad hoc fashion to achievethe shared, mutual goal 50. Exemplary embodiments are thus not limitedto the mobile devices 22 that are carried by, or accompany theirrespective users, during commutes.

FIG. 19 is a flowchart illustrating a method or algorithm for conductingthe auction 34, according to exemplary embodiments. Here the auction 34may be completely managed by the resource server 24. That is, theresource server 24 acts as an auction manager to ensure the auctionrules 90 are fairly implemented. Fair and even-handed auction rules 90ensure that each participant has faith in the auction 34 and that no onemobile device 22, and/or no ad hoc group 20, receives unfairconsideration or access to the resource 30. The auction rules 90 arethus especially important in municipal auctions for traffic lights,parking spaces, and access to other municipal services and resources(electricity, water, fire and police protection).

As FIG. 19 illustrates, the resource server 24 evenhandedly conducts theauction 34. As there may be many people who wish to know of theauctioned resource 30, the resource server 24 may access and implementprotocols that include additional messages that precede and follow bidsubmissions. The resource server 24, for example, may broadcast anannouncement of the auction 34 (Block 200). The announcement describesthe upcoming auction 34 and information for bidding. The announcementmay also have the standardized formatting that is commonly understood.The announcement, for example, may be formatted as

-   -   BIDDING_OPEN[terms],        where the announcement has one or more parameters describing the        upcoming auction 34 for the resource 30. The announcement is        preferably sent to a notification list of network addresses.        Interested parties may register to have their names and/or        addresses added to the notification list, as is known. The        resource server 24 then accepts one or more of the group bids 34        from the ad hoc groups 20 (Block 202). The resource server 24        then compares the group bids 34 to the competing bids 52,        according to the auction rules 90 (Block 204). The resource        server 24 determines the winning bid (Block 206). The auction        protocol may require that the resource server 24 send a        WIN[parameter(s)] message to the winning ad hoc group 20,        informing them of their winning group bid 32 (Block 208). The        WIN[parameter(s)] message may further include an e-voucher or an        immediate enablement of the resource 30. The auction protocol        may further require that the resource server 24 send a        LOSE[parameter(s)] message to each losing ad hoc group 20,        informing them of the winning group bid 32 (Block 210). The        auction protocol may further permit one or more challenge rounds        (Block 212), in which losing ad hoc groups may submit        CHALLENGE[newbid] messages to drive up the auction results        (Block 214). When the challenge rounds are complete or not        permitted (Block 212), the auction concludes.

FIG. 20 is a diagram illustrating a crosswalk 220, according toexemplary embodiments. FIG. 20 illustrates another simple example forrequesting the longer traffic light 40 at the crosswalk 220. As the userapproaches the crosswalk 220, the user's mobile device 22 may influencethe duration 42 of time for walking the crosswalk 220. The user's mobiledevice 22 consults the dictionary (illustrated as reference numeral 104in FIG. 6) to generate the action request 100 as

-   -   ACTION_REQUEST[CrosswalkDuration, location, duration],        where the action code 124 (“CrosswalkDuration”) is the        standardized dictionary term for influencing the traffic light        40 at the crosswalk 220. The location 120 specifies the        geographical location (GPS) of the crosswalk 220 and/or the        traffic light 40. The location 120 may be easily obtained by        scanning a bar code posted on signage or by GPS        latitude/longitude positioning. The duration 42 of time may be        any parameter value for increasing or decreasing the length of        time that the traffic light 40 maintains a red or green state.        The dictionary 104 may include standardized terms, such as        abstract values of “CrosswalkSpeedFast” for a bicyclist or        jogger and “CrosswalkSpeedSlow” for a wheelchair or elderly        pedestrian. As the user approaches the crosswalk 220, exemplary        embodiments thus allow the user's mobile device 22 to influence        the duration 42 of time for walking the crosswalk 220.

The resource server 24 may even store permissions. When the user'smobile device 22 submits the action request 100, the action request 100may route to the network address of the resource server 22. When theresource server 22 receives the action request 100, the resource server22 may recognize the user's mobile device 22 as qualifying for enhancedor increased durations 42 of time. The user's mobile device 22, forexample, may have a network address that is matched to a list ofpreapproved citizens who are authorized to influence the timing of thetraffic light 40. The action request 100 may further specify an amountof time that is always added to timing signals for the traffic light 40.That is, the telephone number, Internet Protocol address, or otheridentifier of the user's mobile device 22 is automatically recognizedand approved for longer red lights at the crosswalk 220. The resourceserver 22 thus adds the amount of time to the duration 42 of the trafficlight 40 before changing its state. The traffic light 40, in otherwords, stays in its red mode of operation for the extra amount of timespecified in the action request 100. Should the user be governmentallyrecognized as needing the additional amount of time to cross thecrosswalk 220, exemplary embodiments automatically influence the trafficlight 40.

FIG. 21 is a schematic illustrating still more exemplary embodiments.FIG. 21 is a more detailed diagram illustrating a processor-controlleddevice 300. As earlier paragraphs explained, the device-side algorithm72, the auction algorithm 78, and/or the grouping algorithm 112 mayoperate in any processor-controlled device. FIG. 21, then, illustratesthe device-side algorithm 72, the auction algorithm 78, and/or thegrouping algorithm 112 stored in a memory subsystem of theprocessor-controlled device 300. One or more processors communicate withthe memory subsystem and execute either, some, or all applications.Because the processor-controlled device 300 is well known to those ofordinary skill in the art, no further explanation is needed.

FIG. 22 depicts other possible operating environments for additionalaspects of the exemplary embodiments. FIG. 22 illustrates thedevice-side algorithm 72, the auction algorithm 78, and/or the groupingalgorithm 112 operating within various other devices 400. FIG. 22, forexample, illustrates that the device-side algorithm 72, the auctionalgorithm 78, and/or the grouping algorithm 112 may entirely orpartially operate within a set-top box (“STB”) (402), a personal/digitalvideo recorder (PVR/DVR) 404, a Global Positioning System (GPS) device408, an interactive television 410, a tablet computer 412, or anycomputer system, communications device, or processor-controlled deviceutilizing the processor 50 and/or a digital signal processor (DP/DSP)414. A big screen display or public sign, for example, may act as acombined resource and arbitrator that accepts bids for content. Anairport lounge may thus auction channels shown on their big screentelevision to highest bidding groups. However, the device 400 may alsoinclude network switches, routers, modems, watches, radios, vehicleelectronics, clocks, printers, gateways, mobile/implantable medicaldevices, and other apparatuses and systems. Because the architecture andoperating principles of the various devices 400 are well known, thehardware and software componentry of the various devices 400 are notfurther shown and described.

Exemplary embodiments may be physically embodied on or in acomputer-readable storage medium. This computer-readable medium, forexample, may include CD-ROM, DVD, tape, cassette, floppy disk, opticaldisk, memory card, memory drive, and large-capacity disks. Thiscomputer-readable medium, or media, could be distributed toend-subscribers, licensees, and assignees. A computer program productcomprises processor-executable instructions for ad hoc groupings, as theabove paragraphs explained.

While the exemplary embodiments have been described with respect tovarious features, aspects, and embodiments, those skilled and unskilledin the art will recognize the exemplary embodiments are not so limited.Other variations, modifications, and alternative embodiments may be madewithout departing from the spirit and scope of the exemplaryembodiments.

1. A method, comprising: storing, in a memory of a computer having the memory and a processor, locations of mobile devices that are registered for ad hoc grouping; receiving, from a requesting mobile device among the mobile devices registered for the ad hoc grouping, an access request specifying a location that corresponds to a goal for an ad hoc group; querying the memory for the location specified in the access request to identify candidate mobile devices, among the mobile devices registered for the ad hoc grouping, that match the access request; retrieving network addresses of the candidate mobile devices; sending invitations to the network addresses of the candidate mobile devices, the invitations inviting the candidate mobile devices to join the ad hoc group; receiving acceptances sent from among the candidate mobile devices invited to join the ad hoc group; forming the ad hoc group from the candidate mobile devices accepting the invitations; and determining a contribution from each one of the candidate mobile devices forming the ad hoc group, wherein the contribution from the each one of the candidate mobile devices forming the ad hoc group is greater than a predetermined threshold, wherein at least two of the candidate mobile devices forming the ad hoc group have unequal contributions, and wherein goals of the candidate mobile devices are stored in the memory before the access request is sent by the requesting mobile device, and wherein the goals are used to match the candidate mobile devices with the access request.
 2. The method of claim 1, further comprising: querying the memory for the goal specified in the access request.
 3. The method of claim 2, further comprising: grouping together the network addresses of the candidate mobile devices matching both the location and the goal specified in the access request.
 4. The method of claim 1, further comprising: sending a group bid from the computer in an auction for a resource, the group bid based on negotiations between the candidate mobile devices forming the ad hoc group.
 5. The method of claim 4, further comprising: determining a processional order for the ad hoc group based on an individual contribution from each one of the candidate mobile devices to the group bid.
 6. The method of claim 1, further comprising: receiving a response at the computer that declines to join the ad hoc group.
 7. The method of claim 1, further comprising: grouping together the network addresses of the candidate mobile devices matching the location specified in the access request.
 8. A system, comprising: a memory that stores instructions; and a processor that executes the instructions, wherein when executed by the processor, the instructions cause the system to perform operations comprising: storing, in the memory, locations of mobile devices that are registered for ad hoc grouping; receiving, from a requesting mobile device among the mobile devices registered for the ad hoc grouping, an access request specifying a location that corresponds to a goal for an ad hoc group; querying the memory for the location specified in the access request to identify candidate mobile devices, among the mobile devices registered for the ad hoc grouping, that match the access request; retrieving network addresses of the candidate mobile devices; sending invitations to the network addresses of the candidate mobile devices, the invitations inviting the candidate mobile devices to join the ad hoc group; receiving acceptances sent from among the candidate mobile devices invited to join the ad hoc group; forming the ad hoc group from the candidate mobile devices accepting the invitations; and determining a contribution from each one of the candidate mobile devices forming the ad hoc group, wherein the contribution from the each one of the candidate mobile devices forming the ad hoc group is greater than a predetermined threshold, wherein at least two of the candidate mobile devices forming the ad hoc group have unequal contributions, and wherein goals of the candidate mobile devices are stored in the memory before the access request is sent by the requesting mobile device, and wherein the goals are used to match the candidate mobile devices with the access request.
 9. The system of claim 8, wherein the operations further comprise querying the memory for the goal specified in the access request.
 10. The system of claim 9, wherein the operations further comprise grouping together the network addresses of the candidate mobile devices matching both the location and the goal specified in the access request.
 11. The system of claim 8, wherein the operations further comprise sending a group bid in an auction for a resource, the group bid based on negotiations between the candidate mobile devices forming the ad hoc group.
 12. The system of claim 11, wherein the operations further comprise determining a processional order for the ad hoc group based on an individual contribution from each one of the candidate mobile devices to the group bid.
 13. The system of claim 8, wherein the operations further comprise receiving a response that declines to join the ad hoc group.
 14. The system of claim 8, wherein the operations further comprise grouping together the network addresses of the candidate mobile devices matching the location specified in the access request.
 15. A memory storing instructions that, when executed, cause a processor to execute the instructions that perform operations, the operations comprising: storing locations of mobile devices that are registered for ad hoc grouping; receiving, from a requesting mobile device among the mobile devices registered for the ad hoc grouping, an access request specifying a location that corresponds to a goal for an ad hoc group; querying for the location specified in the access request to identify candidate mobile devices, among the mobile devices registered for the ad hoc grouping, that match the access request; retrieving network addresses of the candidate mobile devices; sending invitations to the network addresses of the candidate mobile devices, the invitations inviting the candidate mobile devices to join the ad hoc group; receiving acceptances sent from among the candidate mobile devices invited to join the ad hoc group; forming the ad hoc group from the candidate mobile devices accepting the invitations; and determining a contribution from each one of the candidate mobile devices forming the ad hoc group, wherein the contribution from the each one of the candidate mobile devices forming the ad hoc group is greater than a predetermined threshold, wherein at least two of the candidate mobile devices forming the ad hoc group have unequal contributions, and wherein goals of the candidate mobile devices are stored before the access request is sent by the requesting mobile device, and wherein the goals are used to match the candidate mobile devices with the access request.
 16. The memory of claim 15, wherein the operations further comprise querying for the goal specified in the access request.
 17. The memory of claim 16, wherein the operations further comprise grouping together the network addresses of the candidate mobile devices matching both the location and the goal specified in the access request.
 18. The memory of claim 15, wherein the operations further comprise sending a group bid in an auction for a resource, the group bid based on negotiations between the candidate mobile devices forming the ad hoc group.
 19. The memory of claim 18, wherein the operations further comprise determining a processional order for the ad hoc group based on an individual contribution from each one of the candidate mobile devices to the group bid.
 20. The memory of claim 15, wherein the operations further comprise grouping together the network addresses of the candidate mobile devices matching the location specified in the access request. 